Computing the ideal class monoid of an order

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computing the elasticity of a Krull monoid

If S is a Krull monoid with finitely generated divisor class group such that only finitely many divisor classes of S contain prime divisors, then we construct an algorithm to compute the elasticity of S. © 2001 Elsevier Science Inc. All rights reserved. AMS classification: 20M14; 20M25; 13F05; 11Y05

متن کامل

COMPUTING THE EIGENVALUES OF CAYLEY GRAPHS OF ORDER p2q

A graph is called symmetric if its full automorphism group acts transitively on the set of arcs. The Cayley graph $Gamma=Cay(G,S)$ on group $G$ is said to be normal symmetric if $N_A(R(G))=R(G)rtimes Aut(G,S)$ acts transitively on the set of arcs of $Gamma$. In this paper, we classify all connected tetravalent normal symmetric Cayley graphs of order $p^2q$ where $p>q$ are prime numbers.

متن کامل

Computing Simple Roots by an Optimal Sixteenth-Order Class

The problem considered in this paper is to approximate the simple zeros of the function f x by iterative processes. An optimal 16th order class is constructed. The class is built by considering any of the optimal three-step derivative-involved methods in the first three steps of a four-step cycle in which the first derivative of the function at the fourth step is estimated by a combination of a...

متن کامل

A Monoid for the Grassmannian Bruhat Order

Structure constants for the multiplication of Schubert polynomials by Schur symmetric polynomials are related to the enumeration of chains in a new partial order on S 1 , the Grassmaniann Bruhat order. Here we present a monoid M related to this order. We develop a notion of reduced sequences for M and show that M is analogous to the nil-Coxeter monoid for the weak order on S 1 .

متن کامل

The Ideal Class Group

We present a concise and self-contained definition of the ideal class group, which is useful for proving facts about zero sets of Diophantine equations, and discuss a few relevant key facts. We approach this by first assembling some preliminary definitions regarding algebraic integers, and subsequently delving into several useful results about lattices, including Minkowski’s lemma. Then, return...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of the London Mathematical Society

سال: 2019

ISSN: 0024-6107,1469-7750

DOI: 10.1112/jlms.12294